Simplification of many-valued logic formulas using anti-links

Simplification of Many-Valued Logic Formulas Using Anti-Links

We present the theoretical foundations of the many-valued generalization of a technique for simplifying large non-clausal formulas in propositional logic, that is called removal of anti-links. Possible applications include computation of prime implicates of large non-clausal formulas as required, for example, in diagnosis. With the anti-link technique, one does not compute any normal form of a ...

Simpli cation of Many-Valued Logic Formulas Using Anti-Links

We present the theoretical foundations of the many-valued generalization of a technique for simplifying large non-clausal formulas in propositional logic, that is called removal of anti-links. Possible applications of anti-links include computation of prime implicates of large non-clausal formulas as required, for example, in diagnosis. Anti-links do not compute any normal form of a given formu...

Many-valued hybrid logic

In this paper we define a many-valued semantics for hybrid logic and we give a sound and complete tableau system which is prooftheoretically well-behaved, in particular, it gives rise to a decision procedure for the logic. This shows that many-valued hybrid logics is a natural enterprise and opens up the way for future applications.

Resolution Methods for Many - Valued CNF Formulas

Many-valued logic in manufacturing

This paper shows how to enrich the language used in the manufacturing industry regarding information structure and its representation for products and production processes. This is enabled because of our use of many-valued logic, and in order to complement the numerical approach commonly appearing in such representations. We underline the importance of utilizing mathematical disciplines like al...